A Low Complexity Bit-Parallel Multiplier over Finite Fields with ONBs
نویسندگان
چکیده
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملA New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields
In this paper a new bit-parallel structure for a multiplier with low complexity in Galois elds is introduced. The multiplier operates over composite elds GF((2 n) m), with k = nm. The Karatsuba-Ofman algorithm is investigated and applied to the multiplication of polynomials over GF(2 n). It is shown that this operation has a complexity of order O(k log 2 3) under certain constraints regarding k...
متن کاملA New Low Complexity Parallel Multiplier for a Class of Finite Fields
In this paper a new low complexity parallel multiplier for characteristic two finite fields GF (2) is proposed. In particular our multiplier works with field elements represented through both Canonical Basis and Type I Optimal Normal Basis (ONB), provided that the irreducible polynomial generating the field is an All One Polynomial (AOP). The main advantage of the scheme is the resulting space ...
متن کاملA Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields
Problem statement: A fundamental building block for digital communication is the Publickey cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selectin...
متن کاملA Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields
Problem statement: A fundamental building block for digital communication is the Publickey cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selectin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea institute of electronic communication sciences
سال: 2014
ISSN: 1975-8170
DOI: 10.13067/jkiecs.2014.9.4.409